Only Classical Parameterised States have Optimal Measurements under Least Squares Loss

نویسندگان

چکیده

Measurements of quantum states form a key component in quantum-information processing. It is therefore an important task to compare measurements and furthermore decide if measurement strategy optimal. Entropic quantities, such as the Fisher information, capture asymptotic optimality but not with finite resources. We introduce framework that allows one conclusively establish optimal non-asymptotic regime. Our method relies on fundamental property expected errors estimators, known risk, it does involve optimisation over entropic quantities. The applies sample sizes lack prior knowledge, well Bayesian settings. prove no-go theorem shows only classical admit under most common choice error measurement: least squares. further consider less restrictive notion approximately give sufficient conditions for exist. Finally, we generalise when estimator inadmissible (i.e. strictly worse than alternative), provide two be inadmissible.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Recursive Least-Squares Filtering of GPS Pseudorange Measurements

Code pseudorange measurement noise is one of the major error sources in Precise Point Positioning. A recursive least-squares solution with proper functional and stochastic modelling would help to exploit in addition the ultra high precision of the carrier phase measurement. Analyses of different methods, including phase smoothed, phase connected and phase adjusted pseudorange algorithm, will sh...

متن کامل

Multilevel Communication Optimal Least Squares

Using a recently proposed communication optimal variant of TSQR, weak scalability of the least squares solver (LS) with multiple right hand sides is studied. The communication for TSQR based LS solver for multiple right hand sides remains optimal in the sense that no additional messages are necessary compared to TSQR. However, LS has additional communication volume and flops compared to that fo...

متن کامل

Least-Squares Minimization Under Constraints

These algorithms are, however, not designed to perform least-squares minimization under hard constraints. This short report outlines two very simple approaches to doing this to solve problems such as the one depicted by Fig. 1. The first relies on standard Lagrange multipliers [Boyd and Vandenberghe, 2004]. The second is inspired by inverse kinematics techniques [Baerlocher and Boulic, 2004] an...

متن کامل

Least-squares Methods for Optimal Control

Optimal control and optimal shape design problems for the Navier-Stokes equations arise in many important practical applications, such as design of optimal profiles [7], drag minimization [9], [11], and heating and cooling [12], among others. Typically, optimal control problems for the NavierStokes equations combine Lagrange multiplier techniques to enforce the constraints and to derive an opti...

متن کامل

Optimal Rates for Regularized Least Squares Regression

We establish a new oracle inequality for kernelbased, regularized least squares regression methods, which uses the eigenvalues of the associated integral operator as a complexity measure. We then use this oracle inequality to derive learning rates for these methods. Here, it turns out that these rates are independent of the exponent of the regularization term. Finally, we show that our learning...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum

سال: 2023

ISSN: ['2521-327X']

DOI: https://doi.org/10.22331/q-2023-05-11-998